A dynamic learning algorithm for online matching problems with concave returns
نویسندگان
چکیده
منابع مشابه
A Near-Optimal Dynamic Learning Algorithm for Online Matching Problems with Concave Returns
We consider the online matching problem with concave returns. This problem is a significant generalization of the Adwords allocation problem and has vast applications in online advertising. In this problem, a sequence of items arrive sequentially and each has to be allocated to one of the bidders, who bid a certain value for each item. At each time, the decision maker has to allocate the curren...
متن کاملLocal Matching Indicators for Transport Problems with Concave Costs
In this paper, we introduce a class of local indicators that enable to compute efficiently optimal transport plans associated to arbitrary weighted distributions of N demands and M supplies in R in the case where the cost function is concave. Indeed, whereas this problem can be solved linearly when the cost is a convex function of the distance on the line (or more generally when the cost matrix...
متن کاملDELA: A Dynamic Online Ensemble Learning Algorithm
The present paper investigates the problem of prediction in the context of dynamically changing environment, where data arrive over time. A Dynamic online Ensemble Learning Algorithm (DELA) is introduced. The adaptivity concerns three levels: structural adaptivity, combination adaptivity and model adaptivity. In particular, the structure of the ensemble is sought to evolve in order to be able t...
متن کاملA Concave Optimization Algorithm for Matching Partially Overlapping Point Sets
Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment−least square problem and show that after eliminating the transformatio...
متن کاملOnline Matching for Scheduling Problems
In this work an alternative online variant of the matching problem in bipartite graphs is presented. It is motivated by a scheduling problem in an online environment. In such an environment, a task is unknown up to its disclosure. However, in that moment it is not necessary to take a decision on the service of that particular task. In reality, an online scheduler has to decide on how to use the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2015.06.029